General Graph Identification By Hashing
نویسنده
چکیده
A method for identifying graphs using MD5 hashing is presented. This allows fast graph equality comparisons and can also be used to facilitate graph isomorphism testing. The graphs can be labeled or unlabeled. The method identifies vertices by hashing the graph configuration in their neighborhoods. With each vertex hashed, the entire graph can be identified by hashing the vertex hashes.
منابع مشابه
Compressed Image Hashing using Minimum Magnitude CSLBP
Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...
متن کاملNew approaches for representing, analyzing and visualizing complex kinetic mechanisms
Complex kinetic representations involving thousands of reacting species and tens of thousands of reactions are currently required for the rational analysis of modern combustion systems. In order to represent, analyze and visualize effectively the ignition processes advanced computational techniques will be required. Recently, we introduced a novel concept that captured the principal elemental t...
متن کاملDeterministic Parallel Graph Coloring with Hashing
In this paper we propose a new deterministic parallel graph coloring algorithm. Parallelism is achieved by distribution of vertices to processors by hashing. The hashing is based on markers assigned to each conflict prone vertex.
متن کاملScalable Graph Hashing with Feature Transformation
Hashing has been widely used for approximate nearest neighbor (ANN) search in big data applications because of its low storage cost and fast retrieval speed. The goal of hashing is to map the data points from the original space into a binary-code space where the similarity (neighborhood structure) in the original space is preserved. By directly exploiting the similarity to guide the hashing cod...
متن کاملDomain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
We study the problem of securely extending the domain of a collision resistant compression function. A new construction based on directed acyclic graphs is described. This generalizes the usual iterated hashing constructions. Our main contribution is to introduce a new technique for hashing arbitrary length strings. Combined with DAG based hashing, this technique gives a new hashing algorithm. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1512.07263 شماره
صفحات -
تاریخ انتشار 2011